Using the prover ANDP to simplify orthogonality
نویسنده
چکیده
In the 1920s, Heyting attempted at axiomatizing constructive geometry. Recently, von Plato used di4erent concepts to axiomatize the geometry: he used 14 axioms to describe the axiomatization for apartness geometry. Then he added axioms A1 and A2 to his apartness geometry to get his a8ne geometry, then he added axioms O1, O2, O3 and O4 to the a8ne geometry to get orthogonality. In total, this gives 22 axioms. von Plato used four relations to describe the concept of orthogonality in O1, O2 and O4. That is, all the three relations of two lines, which are convergence, unorthogonality and di4erence, and the relation of a point and a line. ANDP is an automated natural deduction prover developed over the years at our institute. After doing a lot of experiments using ANDP, much shorter and more intuitive axioms were found for axioms O1, O2 and O4, respectively. For example, O2 can be replaced by one of its four conjuncts. This paper shows that it is enough to use two relations on lines, which are convergence and unorthogonality, to describe the concept of orthogonality. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Prover / Delayer Game Upper Bounds For Tree Resolution
The purpose of this paper is to show that the Prover / Delayer Game also gives an upper bound on the size of T-RES proofs, and furthermore can be used to simplify those proofs by allowing one to prove bounds on the points scored in the game rather than having to draw out entire T-RES proofs. In effect, the Prover / Delayer Game can be used to simplify upper and lower bounds for both T-RES size ...
متن کاملOrthogonality preserving mappings on inner product C* -modules
Suppose that A is a C^*-algebra. We consider the class of A-linear mappins between two inner product A-modules such that for each two orthogonal vectors in the domain space their values are orthogonal in the target space. In this paper, we intend to determine A-linear mappings that preserve orthogonality. For this purpose, suppose that E and F are two inner product A-modules and A+ is the set o...
متن کاملIntegrating Simplify into Jive
In cooperation with University of Kaiserslautern, the Software Component Technology Group works on the Java Interactive Verification Environment, Jive. Jive allows one to interactively prove that JML annotated Java programs fulfill their specifications. Currently, the interactive theorem prover Isabelle is used for specification and verification of general properties that are not directly relat...
متن کاملFormal Verificaction of the ADSP-2100 Processor Using the HOL Theorem Prover
In this technical report, we present the application of formal verification to digital signal processors of the family ADSP-2100 using the HOL (Higher Order Logic) theorem prover. To solve the problem of complexity related to the big number of parameters of the processor, we used a structured method based on our knowledge about this processors family. In this method, we worked on the units of t...
متن کاملIntegrating Testing and Interactive Theorem Proving
Using an interactive theorem prover to reason about programs involves a sequence of interactions where the user challenges the theorem prover with conjectures. Invariably, many of the conjectures posed are in fact false, and users often spend considerable effort examining the theorem prover’s output before realizing this. We present a synergistic integration of testing with theorem proving, imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 124 شماره
صفحات -
تاریخ انتشار 2003